-
1 combinatorial definability
комбинаторная определимостьБольшой англо-русский и русско-английский словарь > combinatorial definability
-
2 combinatorial definability
Англо-русский технический словарь > combinatorial definability
-
3 combinatorial definability
1) Математика: комбинаторная определённость2) Вычислительная техника: комбинаторная определимостьУниверсальный англо-русский словарь > combinatorial definability
-
4 combinatorial definability
English-Russian dictionary of computer science and programming > combinatorial definability
-
5 combinatorial definability
English-Russian scientific dictionary > combinatorial definability
-
6 definability
combinatorial [combinatory] definability — комбинаторная определимость
-
7 combinatorial
1) комбинаторный
2) комбинационный
3) сочетательный
– combinatorial analysis
– combinatorial automaton
– combinatorial definability
– combinatorial square
– combinatorial theory
– combinatorial topology -
8 definability
Большой англо-русский и русско-английский словарь > definability
-
9 definability
-
10 definability
English-Russian dictionary of computer science and programming > definability
-
11 lemma
-
12 theorem
- analytical hierarchy theorem - arithmetical hierarchy theorem - closed range theorem - formally provable theorem - implicit function theorem - initial value theorem - integral representation theorem - local limit theorem - maximal ergodic theorem - mean value theorem - normal form theorem - ratio limit theorem - rational root theorem - second mean value theorem - theorem of consistency proofs - theorem of corresponding states - three line theorem - three series theorem - uniform convergence theorem - uniform ergodic theorem - uniform mean value theoremtheorem implies — из теоремы следует, что…
См. также в других словарях:
History of the Church-Turing thesis — This article is an extension of the history of the Church Turing thesis.The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… … Wikipedia
History of the Church–Turing thesis — This article is an extension of the history of the Church–Turing thesis. The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… … Wikipedia
Forcing (mathematics) — For the use of forcing in recursion theory, see Forcing (recursion theory). In the mathematical discipline of set theory, forcing is a technique invented by Paul Cohen for proving consistency and independence results. It was first used, in 1963,… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
History of logic — Philosophy ( … Wikipedia
Emil Leon Post — Infobox Scientist name = Emil Leon Post image width = birth date = February 11, 1897 birth place = Augustów, then Russian Empire death date = April 21 1954, death place = New York City, flagicon|USA U.S. residence = nationality = field =… … Wikipedia
Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… … Wikipedia